Distance sets that are a shift of the integers and Fourier basis for planar convex sets
نویسندگان
چکیده
منابع مشابه
Distances Sets That Are a Shift of the Integers and Fourier Basis for Planar Convex Sets
The aim of this paper is to prove that if a planar set A has a difference set ∆(A) satisfying ∆(A) ⊂ Z + s for suitable s than A has at most 3 elements. This result is motivated by the conjecture that the disk has not more than 3 orthogonal exponentials. Further, we prove that if A is a set of exponentials mutually orthogonal with respect to any symmetric convex set K in the plane with a smooth...
متن کاملDistance Sets of Well-distributed Planar Sets for Polygonal Norms
Let X be a 2-dimensional normed space, and let BX be the unit ball in X. We discuss the question of how large the set of extremal points of BX may be if X contains a well-distributed set whose distance set ∆ satisfies the estimate |∆ ∩ [0, N ]| ≤ CN3/2− . We also give a necessary and sufficient condition for the existence of a well-distributed set with |∆ ∩ [0, N ]| ≤ CN .
متن کاملOn convex sets that minimize the average distance
In this paper we study the compact and convex sets K ⊆ Ω ⊆ R that minimize ∫ Ω dist(x,K) dx + λ1V ol(K) + λ2Per(K) for some constants λ1 and λ2, that could eventually be zero. We compute in particular the second order derivative of the functional and use it to exclude smooth points of positive curvature for the problem with volume constraint. The problem with perimeter constraint behaves differ...
متن کاملk-Sets of Convex Inclusion Chains of Planar Point Sets
Given a set V of n points in the plane, we introduce a new number of k-sets that is an invariant of V : the number of k-sets of a convex inclusion chain of V . A convex inclusion chain of V is an ordering (v1, v2, ..., vn) of the points of V such that no point of the ordering belongs to the convex hull of its predecessors. The k-sets of such a chain are then the distinct k-sets of all the subse...
متن کاملInequalities for Lattice Constrained Planar Convex Sets
Every convex set in the plane gives rise to geometric functionals such as the area, perimeter, diameter, width, inradius and circumradius. In this paper, we prove new inequalities involving these geometric functionals for planar convex sets containing zero or one interior lattice point. We also conjecture two results concerning sets containing one interior lattice point. Finally, we summarize k...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Mathematica Hungarica
سال: 2008
ISSN: 0236-5294,1588-2632
DOI: 10.1007/s10474-008-7187-6